Inductive Validity Cores

Symbolic model checkers can construct proofs of properties over highly complex models. However, the results reported by tool when a proof succeeds do not generally provide much insight to user. It is often useful for users have traceability information related proof: which portions were necessary it. This be used diagnose variety modeling problems such as overconstrained axioms and underconstrained properties, measure completeness set requirements model, assist with design optimization given an existing or synthesized implementation. In this paper, we present comprehensive treatment suite algorithms compute inductive validity cores (IVCs), minimal sets elements safety sequential systems. The are based on UNSAT core support built into current SMT solvers novel encodings problem generate approximate guaranteed well all cores. We demonstrate that our correct, describe their implementation in JKind checker Lustre models, several use cases algorithms. then substantial experiment benchmark efficiency efficacy